Pearson Codes

Pearson Codes Jos

The Pearson distance has been advocated for improving the error performance of noisy channels with unknown gain and offset. The Pearson distance can only fruitfully be used for sets of codewords, called Pearson codes, that satisfy specific properties. We will analyze constructions and properties of Pearson codes.

Revisiting Clopper-Pearson

This paper adds one more contribution to the large literature on binomial confidence intervals for small samples (e.g., Clopper and Pearson 1934; Pearson and Hartley 1954; Sterne 1954; Crow 1956; Blyth and Still 1983; Blyth 1986; Santner and Duffy 1989; Agresti and Coull 1998; Henderson and Meyer 2001). Clopper and Peason (1934) gave the first two-sided binomial confidence intervals, in graphic...

Fractional Pearson Diffusions.

Pearson diffusions are governed by diffusion equations with polynomial coefficients. Fractional Pearson diffusions are governed by the corresponding time-fractional diffusion equation. They are useful for modeling sub-diffusive phenomena, caused by particle sticking and trapping. This paper provides explicit strong solutions for fractional Pearson diffusions, using spectral methods. It also pre...

Generalized Neyman - Pearson Lemma

We extend the classical Neyman-Pearson theory for testing composite hypotheses versus composite alternatives, using a convex duality approach as in Witting (1985). Results of Aubin & Ekeland (1984) from non-smooth convex analysis are employed, along with a theorem of Komll os (1967), in order to establish the existence of a max-min optimal test and to investigate its properties. The theory is i...

Pearson Product-Moment Correlation